Component refinement and CSC-solving for STG decomposition

Component Refinement and CSC Solving for STG Decomposition

STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondeterministic algorithm for decomposing STGs was suggested by Chu and improved by one of the present authors. In this paper it is studied how CSC solving (which is essential for circuit synthesis) can be combined with de...

STG Decomposition: Avoiding Irreducible CSC Conflicts by Internal Communication

A Technique to Automate STG Analysis and Refinement for CSC and Normalcy

One of the formalisms used for specifying the control dominated circuits' behavior is Signal Transition Graph (STG) an interpreted Petri Net where events represent the transitions of circuit signals. There is a number of properties the speci cation must satisfy for being implementable by speed-independent (SI) circuit composed of logic gates. These are widely investigated in a number of works. ...

A Technique to Automate STG Analysis and Refinement for CSC and Normalcy

Signal Transition Graph (STG) is a well-known form of specifying the system behavior along with the behavior of its environment. Normalcy has recently gained the circuits designers’ attention as an STG property, which guarantees that the behavior given by STG is implementable by a circuit composed of negative or positive gates without input inverters. This contributes to the circuit robustness ...

STG Decomposition and Its Correctness∗

The behaviour of asynchronous control circuits can be specified with Signal Transition Graphs (STGs), i.e. Petri nets where transitions are labelled with rising and falling edges of circuit signals. Speed independent (SI) circuits (an important and robust subclass of asynchronous circuits) can be synthesized from STGs with tools like PETRIFY [3] and PUNF&MPSAT [6]. For this purpose, PETRIFY bui...